Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
191	Advanced Algorithms – COMS31900Lecture 17 Approximation Algorithms (part two) more constant factor approximations Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Mathematics Scheduling Job shop scheduling Mathematical sciences Theoretical computer science Bin packing problem Algorithm Shifting bottleneck heuristic David Shmoys Operations research Applied mathematics Mathematical optimization
192	Microsoft PowerPoint - mmds Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2006-10-15 22:45:52 Artificial intelligence Approximation algorithms Mathematics Nearest neighbor search Search algorithms Dimension reduction Locality-sensitive hashing
193	Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes NP-complete problems Bin packing problem Approximation algorithms Discrete geometry Packing problem Polynomial-time approximation scheme Time complexity Bin Theoretical computer science Computational complexity theory Applied mathematics
194	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Bin packing problem Approximation algorithm Polynomial-time approximation scheme Subset sum problem NP PP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
195	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Operations research Bin packing problem Approximation algorithm Job shop scheduling Greedy algorithm Algorithm Theoretical computer science Mathematics Applied mathematics
196	Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Dynamic programming Subset sum problem Bin packing problem Approximation algorithm Complexity classes Combinatorial optimization NP Partition problem Theoretical computer science Computational complexity theory Applied mathematics
197	Advanced Algorithms – COMS31900Lecture 16 Approximation Algorithms (part one) P, NP and constant factor approximations Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Applied mathematics NP-complete NP-hard P versus NP problem NP Polynomial-time reduction P Complete Reduction Theoretical computer science Computational complexity theory Complexity classes
198	Nearest Neighbor Search in Google Correlate Dan Vanderkam Robert Schonberger Henry Rowley Add to Reading List Source URL: static.googleusercontent.com Language: English - Date: 2013-10-11 18:33:56 Artificial intelligence Approximation algorithms Discrete geometry Mathematical optimization Nearest neighbor search Numerical analysis Google Search Google Influenza Information science Search algorithms Information retrieval
199	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
200	Figure 1: The collaborative topic Poisson factorization model (CTPF). A Stochastic variational inference for the collaborative topic Poisson factorization model Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-11-03 20:43:29 Machine learning Latent Dirichlet allocation Stochastic approximation Mathematics Mathematical optimization Bayesian statistics Evolutionary algorithms Dynamic topic model Stochastic optimization Statistics Statistical natural language processing

UPDATE